Exploring Extensions of Possibilistic Logic over Gödel Logic
نویسندگان
چکیده
In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language composed of non-modal and modal formulas, the latter moreover not allowing for nested applications of the modal operator N . Besides, a full fuzzy modal logic for graded necessity over Gödel logic is also introduced together with an algebraic semantics, the class of NG-algebras.
منابع مشابه
Formalizing argumentative reasoning in a possibilistic 3 logic programming setting with fuzzy unification q
12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...
متن کاملFormalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAn Extension of Gödel Logic for Reasoning under Both Vagueness and Possibilistic Uncertainty
In this paper we introduce a logic called FNG∼(Q) that combines the well-known Gödel logic with a strong negation, rational truthconstants and Possibilistic logic. In this way, we can formalize reasoning involving both vagueness and (possibilistic) uncertainty. We show that the defined logical system is useful to capture the kind of reasoning at work in the medical diagnosis system CADIAG-2, an...
متن کاملExtending possibilistic logic over Gödel logic
In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...
متن کامل